Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
نویسندگان
چکیده
منابع مشابه
Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
We consider the family of decision problems of the threshold languages L g. A threshold language L g is the set of n bit vectors having at least g(n) \1"s. Using a new technique for controlling the size and structure of a hypergraph by a potential function, we prove lower bounds for these decision problems on a PRIORITY PRAM with m shared memory cells and any polynomial number of processors. Th...
متن کاملLower bounds on communication for multiparty computation
The present report contains a proof of a linear lower bound for a typical three-party secure computation scheme of n independent AND functions. The goal is to prove some linear communication lower bound for a maximally broad definition of «typical». The article [1] contains various communications lower bounds for unconditionally secure multiparty computation. In particular, it contains a linear...
متن کاملLower Bounds for Symbolic Computation on Graphs
A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly conne...
متن کاملAlgorithms and Lower Bounds for Threshold Circuits
A fundamental purpose of theory of computation is to understand differences between uniform computation and nonuniform one. In particular, Boolean circuit has been studied in an area of nonuniform computation models, because Boolean circuits are natural formalization of computer architecture and hardware. Boolean circuit is compared with uniform computation expressed as fixed size programs whic...
متن کاملFinite Limits and Lower Bounds for Circuits
Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2018
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3232536